A shorter proof of Kanter’s Bessel function concentration bound
نویسندگان
چکیده
منابع مشابه
O ct 2 00 6 A shorter proof of Kanter ’ s Bessel function concentration bound
We give a shorter proof of Kanter's (1976) sharp Bessel function bound for concentrations of sums of independent symmetric random vectors. We provide sharp upper bounds for the sum of modified Bessel functions I 0 (x) + I 1 (x), which might be of independent interest. Corollaries improve concentration or smoothness bounds for sums of independent random variables due toČekanavičius
متن کاملA Bessel Function Multiplier
We obtain nearly sharp estimates for the L p (R 2) norms of certain convolution operators. For n 1 let n be the measure on R 2 obtained by multiplying normalized arclength measure on fjxj = 1g by the oscillating factor e inarg(x). For 1 p 1, let C(p; n) denoted the norm of the operator T n f : = n f on L p (R 2). The purpose of this note is to estimate the rate of decay of C(p; n) as n ! 1. By ...
متن کاملA Proof of a Recursion for Bessel Moments
We provide a proof of a conjecture in [2] on the existence and form of linear recursions for moments of powers of the Bessel function K0.
متن کاملA Proof of a Recurrence for Bessel Moments
We provide a proof of a conjecture in [2] on the existence and form of linear recursions for moments of powers of the Bessel function K0.
متن کاملA shorter proof of the Graph Minor Algorithm
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful theoremwhich describes the structure of graphs excluding a fixed minor. This result is used to prove Wagner’sconjecture and provide a polynomial time algorithm for the disjoint paths problem when the numberof the terminals is fixed (i.e, the Graph Minor Algorithm). However, both results require the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2006
ISSN: 0178-8051,1432-2064
DOI: 10.1007/s00440-006-0043-0